Constraints on Abstraction: Generalization Across Languages
نویسنده
چکیده
Recent research has suggested a division between lexical representations and phonological patterns; lexical items are stored with talker-specific information, while phonological patterns are represented at a separate, abstract level of representation (Finley, 2013; Smolensky & Legendre, 2006). The present paper provides further evidence for this proposal, demonstrating that learners will extend a novel phonological pattern (vowel harmony) to speakers of a novel dialect when the words are familiar, but not when the words are unfamiliar, further supporting a distinction between the representations of lexical items and the representations of phonological patterns.
منابع مشابه
Guidance, Please! Towards a Framework for RDF-Based Constraint Languages
In the context of the DCMI RDF Application Profile task group and the W3C Data Shapes Working Group solutions for the proper formulation of constraints and validation of RDF data on these constraints are being developed. Several approaches and constraint languages exist but there is no clear favorite and none of the languages is able to meet all requirements raised by data practitioners. To sup...
متن کاملDimensions of Object-Based Language Design, 1987
The design space of object-based languages is characterized in terms of objects, classes, inheritance, data abstraction, strong typing, concurrency, and persistence. Language classes (paradigms) associated with interesting subsets of these features are identified and language design issues for selected paradigms are examined. Orthogonal dimensions that span the object-oriented design space are ...
متن کاملAlgorithmic Abstraction in Object-Oriented Languages
The abstraction gap between algorithms and procedures causes numerous duplicate eeorts in implementing the same algorithms as well as apparent under-use of many eecient algorithms. A solution to this problem is to realize algorithmic abstraction at the programming language level in addition to data abstraction. In this paper, we rst discuss the two conditions for a programming language to suppo...
متن کاملSubtyping Constrained Types ( Draft ) Valery Trifonov
Constrained type systems are a natural generalization of Hindley/Milner type inference to languages with subtyping. This paper develops several subtyping relations on constrained types. We establish a full type abstraction property that equates an operational notion of subtyping with a semantic notion based on regular trees. The decidability of this notion of subtyping is open; we present a dec...
متن کاملAbstract Processes in Orchestration Languages
Processes in Orchestration Languages Maria Grazia Buscemi1 and Hernán Melgratti2 1 IMT Lucca Institute for Advanced Studies, Italy [email protected] 2 FCEyN, University of Buenos Aires, Argentina [email protected] Abstract. Orchestrators are descriptions at implementation level and may contain sensitive information that should be kept private. Consequently, orchestration languages come equi...
متن کامل